Secure Multi-Party Proof and its Applications

We define a new type cryptographical model called secure multi-party proof that allows any t players and a verifier to securely compute a function ) ,..., ( 1 t x x f : each of the players learns nothing about other players’ input and about the value of f , and the verifier obtains the value of f and it’s validity but learns nothing about the input of any of the players. It is implemented by a protocol using oblivious transfer and Yao’s scrambled circuit. We prove that our protocol is secure if the players and the verifier are semi-honest (i.e. they follow the protocol) and polynomial time bounded. The main applications of our protocol are for electronic voting and electronic bidding.